Probabilistic Choice and Stochastic Dominance
نویسندگان
چکیده
April 2008 Abstract This paper presents an axiomatic model of probabilistic choice under risk. In this model, when it comes to choosing one lottery over another, each alternative has a chance of being selected, unless one lottery stochastically dominates the other. An individual behaves as if he compares lotteries to a reference lottery—a least upper bound or a greatest lower bound in terms of weak dominance. The proposed model is compatible with several well-known violations of expected utility theory such as the common ratio effect and the violations of the betweenness. Necessary and sufficient conditions for the proposed model are completeness, weak stochastic transitivity, continuity, common consequence independence, outcome monotonicity, and odds ratio independence.
منابع مشابه
Multi-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کاملMaximal domain for strategy-proof probabilistic rules in economies with one public good
We consider the problem of choosing a level of provision of public good on an interval of the real line among a group of agents. A probabilistic rule chooses a probability distribution over the interval to each preference profile. We investigate strategy-proof probabilistic rules in the case where distributions are compared based on stochastic dominance relation. First, on a “minimally rich dom...
متن کاملA Generalization of Probabilistic Serial to Randomized Social Choice
The probabilistic serial rule is one of the most wellestablished and desirable rules for the random assignment problem. We present the egalitarian simultaneous reservation social decision scheme — an extension of probabilistic serial to the more general setting of randomized social choice. We consider various desirable fairness, efficiency, and strategic properties of social decision schemes an...
متن کاملImpossibilities for probabilistic assignment
We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...
متن کاملRank Maximal Equal Contribution: a Probabilistic Social Choice Function
When aggregating preferences of agents via voting, two desirable goals are to incentivize agents to participate in the voting process and then identify outcomes that are Pareto efficient. We consider participation as formalized by Brandl, Brandt, and Hofbauer (2015) based on the stochastic dominance (SD) relation. We formulate a new rule called RMEC (Rank Maximal Equal Contribution) that satisf...
متن کامل